A Prediction Algorithm based on Markov Chains for finding the Minimum Cost Path in a Mobile WSNs
نویسندگان
چکیده
منابع مشابه
Finding A Minimum Cost Acceptable Path in Parallel 1
We consider the problem of nding a minimum cost acceptable path on a toroidal grid graph, where each horizontal and each vertical edge have the same orientation. An acceptable path is closed path that makes a complete horizontal and vertical circuit. We exploit the structure of this graph to develop eecient parallel algorithms for a message passing computer. Given p processors and an m by n tor...
متن کاملdeveloping a pattern based on speech acts and language functions for developing materials for the course “ the study of islamic texts translation”
هدف پژوهش حاضر ارائه ی الگویی بر اساس کنش گفتار و کارکرد زبان برای تدوین مطالب درس "بررسی آثار ترجمه شده ی اسلامی" می باشد. در الگوی جدید، جهت تدوین مطالب بهتر و جذاب تر، بر خلاف کتاب-های موجود، از مدل های سطوح گفتارِ آستین (1962)، گروه بندی عملکردهای گفتارِ سرل (1976) و کارکرد زبانیِ هالیدی (1978) بهره جسته شده است. برای این منظور، 57 آیه ی شریفه، به صورت تصادفی از بخش-های مختلف قرآن انتخاب گردید...
15 صفحه اولThe Minimum Cost Path Finding Algorithm Using a Hopfield Type Neural Network
Recently neural networks have been ploposed as new computational tools for solving constrained optimization problems. In this paper the minimum cost path fmding algorithm is proposed by using a Hopfield type neural network. In order to design a Hopfield type neural network, an energy function must be defmed at f i t . To achieve thii, the concept of a vector-represented network is used to descr...
متن کاملMinimum-Cost Spanning Tree as a Path-Finding Problem
In this paper we show that minimum-cost spanning tree is a special case of the closed semiring path-nding problem. This observation gives us a non-recursive algorithm for nding minimum-cost spanning trees on mesh-connected computers that has the same asymptotic running time but is much simpler than the previous recursive algorithms.
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computers Communications & Control
سال: 2019
ISSN: 1841-9836,1841-9836
DOI: 10.15837/ijccc.2019.1.3487